Error bounds for complementarity problems with tridiagonal nonlinear functions
نویسندگان
چکیده
منابع مشابه
Error Bounds for R0-Type and Monotone Nonlinear Complementarity Problems
The paper generalizes the Mangasarian-Ren 10] error bounds for linear complementarity problems (LCPs) to nonlinear complementarity problems (NCPs). This is done by extending the concept of R 0-matrix to several R 0-type functions, which include a subset of monotone functions as a special case. Both local and global error bounds are obtained for the R 0-type and some monotone NCPs.
متن کاملError bounds for symmetric cone complementarity problems
In this paper, we investigate the issue of error bounds for symmetric cone complementarity problems (SCCPs). In particular, we show that the distance between an arbitrary point in Euclidean Jordan algebra and the solution set of the symmetric cone complementarity problem can be bounded above by some merit functions such as FischerBurmeister merit function, the natural residual function and the ...
متن کاملComputation of Error Bounds for P-matrix Linear Complementarity Problems
We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix linear interval system. Moreover, for the involved matrix being an H-matrix with positive diagonals, an error bound can be found by solving a linear system of equations, which is sharper than the Mathias-Pang error bound. Pre...
متن کاملD-orientation sequences for continuous functions and nonlinear complementarity problems
We introduce the new concept of d-orientation sequence for continuous functions. It is shown that if there does not exist a d-orientation sequence for a continuous function, then the corresponding complementarity problem (CP) has a solution. We believe that such a result characterizes an intrinsic property of CPs. As the concept of ``exceptional family of elements'', the notion of ``d-orientati...
متن کاملError bounds for mixed integer nonlinear optimization problems
We introduce a-posteriori and a-priori error bounds for optimality and feasibility of a point generated as the rounding of an optimal point of the NLP relaxation of a mixed-integer nonlinear optimization problem. Our analysis mainly bases on the construction of a tractable approximation of the so-called grid relaxation retract. Under appropriate Lipschitz assumptions on the defining functions, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing
سال: 2008
ISSN: 0010-485X,1436-5057
DOI: 10.1007/s00607-008-0021-8